#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 105;
const double eps = 1e-6;

int n, m;
double a[N][N << 1];
int get_mx(int i) {
  int mx = i;
  rep(j, i, n) {
    if (abs(a[j][i]) > abs(a[mx][i])) mx = j;
  }
  return mx;
}
void swap_line(int i, int j) { rep(k, 1, n + 1) swap(a[i][k], a[j][k]); }
void normal_line(int i) {
  double x = a[i][i];
  rep(j, i, n + 1) a[i][j] /= x;
}
void sub_line(int j, int i, double x) {
  rep(k, i, n + 1) a[j][k] -= x * a[i][k];
}
void out() {
  rep(i, 1, n) {
    rep(j, 1, n + 1) cout << a[i][j] << ' ';
    cout << endl;
  }
  cout << endl;
}
bool gauss() {
  rep(i, 1, n) {
    int id = get_mx(i);
    if (abs(a[id][i]) < eps) return false;
    if (id != i) swap_line(i, id);
    normal_line(i);
    rep(j, 1, n) {
      if (j == i) continue;
      sub_line(j, i, a[j][i]);
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n) rep(j, 1, n + 1) cin >> a[i][j];
  bool res = gauss();
  if (!res)
    cout << "No Solution";
  else
    rep(i, 1, n) cout << fixed << setprecision(2) << a[i][n + 1] << endl;
  return 0;
}